The IDP framework for declarative problem

The IDP framework is a declarative problem solving paradigm, in which the computational task is to expand a given finite interpretation of a set of symbols into a model of a given ID-logic theory, a classical logic theory extended with inductive definitions. This framework has been proposed as a general approach for solving finite domain problems. In this paper, we introduce a typed version of the IDP-language, illustrate the use of the framework through some prototypical examples and discuss theoretical and methodological aspects. We also compare the framework to SAT and ASP. Finally, we report on an implementation of IDP.